The epistemology of special majority voting
نویسندگان
چکیده
It is known that, in Condorcet's classical jury model, the proportion of jurors supporting a decision is not a significant indicator of that decision's reliability: the probability that a particular majority decision is correct given the majority size depends only on the absolute margin between the majority and the minority, and is invariant under changes of the proportion in the majority if the absolute margin is held fixed. Here I show that, if juror competence depends on the jury size, the proportion may become significant: there are then conditions in which the probability that a given majority decision is correct depends only on the proportion of jurors supporting that decision, and is invariant under changes of the jury size. The proportion is significant in this way if and only if juror competence is a particular decreasing function of the jury size. Yet the required condition on juror competence is not only highly special – thereby casting doubt on the significance of the proportion in realistic conditions – but it also undermines the Condorcet jury theorem. If the proportion is significant, then the jury theorem fails to hold; and if the jury theorem holds, then the proportion is not significant. I discuss the implications of these results for defining and justifying special majority voting from the perspective of an epistemic account of voting.
منابع مشابه
Voting Algorithm Based on Adaptive Neuro Fuzzy Inference System for Fault Tolerant Systems
some applications are critical and must designed Fault Tolerant System. Usually Voting Algorithm is one of the principle elements of a Fault Tolerant System. Two kinds of voting algorithm are used in most applications, they are majority voting algorithm and weighted average algorithm these algorithms have some problems. Majority confronts with the problem of threshold limits and voter of weight...
متن کاملVoting Algorithm Based on Adaptive Neuro Fuzzy Inference System for Fault Tolerant Systems
some applications are critical and must designed Fault Tolerant System. Usually Voting Algorithm is one of the principle elements of a Fault Tolerant System. Two kinds of voting algorithm are used in most applications, they are majority voting algorithm and weighted average algorithm these algorithms have some problems. Majority confronts with the problem of threshold limits and voter of weight...
متن کاملA New Proposal on Special Majority Voting
Special majority voting is usually defined in terms of the proportion of the electorate required for a positive decision. This note reassesses that definition, and proposes an alternative. The proposal is to define special majority voting in terms of the absolute margin between the majority and the minority required for a positive definition. It is shown that if we use special majority voting f...
متن کاملDouble voter perceptible blind signature based electronic voting protocol
Mu et al. have proposed an electronic voting protocol and claimed that it protects anonymity of voters, detects double voting and authenticates eligible voters. It has been shown that it does not protect voter's privacy and prevent double voting. After that, several schemes have been presented to fulfill these properties. However, many of them suffer from the same weaknesses. In this p...
متن کاملVoting and different ranking orders in DEA
Data Envelopment Analysis (DEA) technique now widely use for efficiency evaluation of a set of Decision Making Units (DMUs). As regards of the necessity for ranking efficient units different DEA models presented each of which has advantages and rank efficient units from special aspects. Note that all the existing ranking models have disadvantages, as well and there is not a model in which all t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003